Packing 4-Cycles in Eulerian and Bipartite Eulerian Tournaments with an Application to Distances in Interchange Graphs
نویسندگان
چکیده
منابع مشابه
Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
We prove that every Eulerian orientation of Km,n contains 1 4+ √ 8 mn(1 − o(1)) arc-disjoint directed 4-cycles, improving earlier lower bounds. Combined with a probabilistic argument, this result is used to prove that every regular tournament with n vertices contains 1 8+ √ 32 n2(1−o(1)) arc-disjoint directed 4-cycles. The result is also used to provide an upper bound for the distance between t...
متن کاملPacking Odd Circuits in Eulerian Graphs
Let C be the clutter of odd circuits of a signed graph ðG;SÞ: For nonnegative integral edge-weights w; we are interested in the linear program minðwtx: xðCÞ51; for C 2 C; and x50Þ; which we denote by (P). The problem of solving the related integer program clearly contains the maximum cut problem, which is NP-hard. Guenin proved that (P) has an optimal solution that is integral so long as ðG;SÞ ...
متن کاملDisjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs
Let R=(r1, ..., rm) and S=(s1, ..., sn) be nonnegative integral vectors with ; ri=; sj. Let A(R, S) denote the set of all m×n {0, 1}-matrices with row sum vector R and column sum vector S. Suppose A(R, S) ]”. The interchange graph G(R, S) of A(R, S) was defined by Brualdi in 1980. It is the graph with all matrices in A(R, S) as its vertices and two matrices are adjacent provided they differ by ...
متن کاملThe asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
Let RT (n), ED(n) and EOG(n) be the number of labelled regular tournaments, labelled loop-free simple Eulerian digraphs, and labelled Eulerian oriented simple graphs, respectively, on n vertices. Then, as n →∞, RT (n) = (2n+1 πn )(n−1)/2 n1/2e−1/2 ( 1 + O(n−1/2+ ) ) (n odd), ED(n) = ( 4 πn )(n−1)/2 n1/2e−1/4 ( 1 + O(n−1/2+ ) ) , and EOG(n) = (3n+1 4πn )(n−1)/2 n1/2e−3/8 ( 1 + O(n−1/2+ ) ) , for...
متن کاملMaximum cycle packing in Eulerian graphs using local traces
For a graph G = (V,E) and a vertex v ∈ V , let T (v) be a local trace at v, i.e. T (v) is an Eulerian subgraph of G such that every walk W (v), with start vertex v can be extended to an Eulerian tour in T (v). We prove that every maximum edge-disjoint cycle packing Z∗ of G induces a maximum trace T (v) at v for every v ∈ V . Moreover, if G is Eulerian then sufficient conditions are given that g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2005
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-005-0244-0